CSWB: Where complexity serves simple ideals

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?

  Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...

متن کامل

Where Morphological Complexity Matters

It has been long observed that Latinate verbs in English cannot appear in verb-particle constructions, resultative constructions, and double object constructions. Recent research has revealed that, despite persistent counterexamples, the hypothesis invoking the morphological complexity of verbs is the most promising in dealing with the Latinate/native asymmetry (Coppock, 2009; Harley, 2008; Pun...

متن کامل

On Polynomial Ideals, Their Complexity, and Applications

A polynomial ideal membership problem is a (w+1)-tuple P = (f; g 1 ; g 2 ; : : : ; g w) where f and the g i are multivariate polynomials over some ring, and the problem is to determine whether f is in the ideal generated by the g i. For polynomials over the integers or rationals, it is known that this problem is exponential space complete. We discuss complexity results known for a number of pro...

متن کامل

Some Complexity Results for Polynomial Ideals

In this paper, we survey some of our new results on the complexity of a number of problems related to polynomial ideals. We consider multivariate polynomials over some ring, like the integers or the rationals. For instance, a polynomial ideal membership problem is a (w + 1)-tuple P = ( f, g1, g2, . . . , gw) where f and the gi are multivariate polynomials, and the problem is to determine whethe...

متن کامل

Ideals with bases of unbounded Borel complexity

We present several naturally defined σ–ideals which have Borel bases but, unlike for the classical examples, these bases are not of bounded Borel complexity. We investigate set-theoretic properties of such σ–ideals.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Community Safety and Well-Being

سال: 2018

ISSN: 2371-4298

DOI: 10.35502/jcswb.70